The maximal number of cubic runs in a word
نویسندگان
چکیده
Article history: Received 19 September 2010 Received in revised form 18 April 2011 Accepted 17 November 2011 Available online 27 December 2011
منابع مشابه
On the Maximal Number of Cubic Runs in a String
A run is an inclusion maximal occurrence in a string (as a subinterval) of a factor in which the period repeats at least twice. The maximal number of runs in a string of length n has been thoroughly studied, and is known to be between 0.944n and 1.029n. The proofs are very technical. In this paper we investigate cubic runs, in which the period repeats at least three times. We show the upper bou...
متن کاملComputing the Number of Cubic Runs in Standard Sturmian Words
The standard Sturmian words are extensively studied in combinatorics of words. They are enough complicated to have many interesting properties and at the same time they are highly compressible. In this paper we present compact formulas for the number ρ of cubic runs in any standard word. We show also that lim |w|→∞ ρ(w) |w| = 5Φ+ 3 13Φ+ 9 ≈ 0.36924841 and present the sequence of strictly growin...
متن کاملCartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of numbers. It shows how to efficiently compute runs, that is, maximal periodicities occurring in a word. 1 Cartesian and Lyndon trees The Cartesian tree, introduc...
متن کاملModified Padovan words and the maximum number of runs in a word
A run (or maximal periodicity) in a word is a periodic factor whose length is at least twice the period and which cannot be extended to the left or right without changing the period. Recently Kusano et al. [6] used a clever search technique to find run-rich words and were able to show that the number of runs in a word of length n can be greater than 0.94457564n. In this paper we use a two-stage...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 78 شماره
صفحات -
تاریخ انتشار 2012